The minimal density of a letter in an infinite ternary square - free word is 0 . 2746

نویسنده

  • Yuriy Tarannikov
چکیده

We study the minimal density of letters in infinite square-free words. First, we give some definitions of minimal density in infinite words and prove their equivalence. Further, we propose a method that allows to strongly reduce an exhaustive search for obtaining lower bounds for minimal density. Next, we develop a technique for constructing square-free morphisms with extremely small density for one letter that gives upper bounds on the minimal density. As an application of our technique we prove that the minimal density of any letter in infinite ternary square-free words is 0.2746 · · ·. A word is called square-free if it cannot be written in the form axxb for two words a, b and a nonempty word x. It is easy to see that the maximal length of a binary square-free word is 3. A. Thue proved [8] that there exist ternary square-free words. The number of ternary square-free words of length n is given by the sequence A006156 in The Encyclopedia of Integer Sequences [7]. Ekhad and Zeilberger [2] proved that the number of ternary squarefree words of length n is at least 2. Grimm [3] gave a better bound; he proved that this number is at least 65. Note that not every finite square-free word can be extended to an infinite square-free word. In this paper we prove that the minimal density of any letter in an infinite ternary square-free word is 0.2746 · · ·.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$

We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we • characterize all the (two-way) infinite ternary square-free words avoiding letter pattern xyzxzyx • characterize the lexicographically least (one-way) infinite ternary square-free w...

متن کامل

Letter frequency in infinite repetition-free words

We estimate the extremal letter frequency in infinite words over a finite alphabet avoiding some repetitions. For ternary square-free words, we improve the bounds of Tarannikov on the minimal letter frequency, and prove that the maximal letter frequency is 255 653 . Kolpakov et al. have studied the function ρ such that ρ(x) is the minimal letter frequency in an infinite binary x-free word. In p...

متن کامل

Unequal letter frequencies in ternary square-free words

We consider the set S of triples (x, y, z) corresponding to the frequency of each alphabet letter in some infinite ternary square-free word (so x + y+ z = 1). We conjecture that this set is convex. We obtain bounds on S by with a generalization of our method to bound the extremal frequency of one letter. This method uses weights on the alphabet letters. Finally, we obtain positive results, that...

متن کامل

n-Letter Ternary Square-Free Words

Recently, Ekhad and Zeilberger [4] presented an improved lower bound for the “connective constant” of ternary square-free words. Their bound of 2 is proven by constructing a “Brinkhuis triple-pair” of length 18. By presenting a Brinkhuis triple-pair of length 17, we show that, within the same particular class of Brinkhuis triples, the optimal bound is actually 2. A square-free word w is a word ...

متن کامل

Infinite ternary square-free words concatenated from permutations of a single word

We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n ≥ 13. We show that there are uniform ternary morphisms of length k for every k ≥ 23. This resolves almost completely a problem of the author and Rampersad.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004